Non-rigid Cerebral Surface Registration for Neonates Using ICP Algorithm
نویسندگان
چکیده
منابع مشابه
Rigid Point-Surface Registration Using an EM Variant of ICP for Computer Guided Oral Implantology
We investigate the rigid registration of a set of points onto a surface for computer-guided oral implants surgery. We first formulate the Iterative Closest Point (ICP) algorithm as a Maximum Likelihood (ML) estimation of the transformation and the matches. Then, considering matches as a hidden random variable, we show that the ML estimation of the transformation alone leads to a criterion effic...
متن کاملA modified ICP algorithm for normal-guided surface registration
The iterative closest point (ICP) algorithm is probably the most popular algorithm for fine registration of surfaces. Among its key properties are: a simple minimization scheme, proofs of convergence as well as the easiness to modify and improve it in many ways (e.g. use of fuzzy point correspondences, incorporation of a priori knowledge, extensions to non-linear deformations, speed-up strategi...
متن کاملNon-rigid Surface Registration Using Spherical Thin-Plate Splines
Accurate registration of cortical structures plays a fundamental role in statistical analysis of brain images across population. This paper presents a novel framework for the non-rigid intersubject brain surface registration, using conformal structure and spherical thin-plate splines. By resorting to the conformal structure, complete characteristics regarding the intrinsic cortical geometry can...
متن کاملNon-rigid Registration Using Morphons
The Morphon, a non-rigid registration method is presented and applied to a number of registration applications. The algorithm takes a protoype image (or volume) and morphs it into a target image using an iterative, multi-resolution technique. The deformation process is done in three steps: displacement estimation, deformation field accumulation and deformation. The framework could be described ...
متن کاملA new point matching algorithm for non-rigid registration
Feature-based methods for non-rigid registration frequently encounter the correspondence problem. Regardless of whether points, lines, curves or surface parameterizations are used, feature-based non-rigid matching requires us to automatically solve for correspondences between two sets of features. In addition, there could be many features in either set that have no counterparts in the other. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2016
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.29.195